0.04/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.10 % Command : run_vampire %s %d THM 0.09/0.29 % Computer : n022.cluster.edu 0.09/0.29 % Model : x86_64 x86_64 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.29 % Memory : 8042.1875MB 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.29 % CPULimit : 1920 0.09/0.30 % WCLimit : 240 0.09/0.30 % DateTime : Wed Jul 30 02:14:04 EDT 2025 0.09/0.30 % CPUTime : 0.09/0.31 This is a THF_ problem 0.09/0.31 Running higher-order theorem proving 0.16/0.31 Running /export/starexec/sandbox/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/tmp/tmp.b7MyrQN9f1/E---3.1_11852.p -m 16384 -t 240 0.16/0.33 % (11961)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on E---3.1_11852 for (2399ds/27Mi) 0.16/0.33 % (11963)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on E---3.1_11852 for (2399ds/2Mi) 0.16/0.33 % (11962)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on E---3.1_11852 for (2399ds/2Mi) 0.16/0.33 % (11965)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on E---3.1_11852 for (2399ds/18Mi) 0.16/0.33 % (11964)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on E---3.1_11852 for (2399ds/275Mi) 0.16/0.33 % (11959)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on E---3.1_11852 for (2399ds/183Mi) 0.16/0.33 % (11960)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on E---3.1_11852 for (2399ds/4Mi) 0.16/0.33 % (11963)Instruction limit reached! 0.16/0.33 % (11963)------------------------------ 0.16/0.33 % (11963)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200) 0.16/0.33 % (11963)Termination reason: Unknown 0.16/0.33 % (11963)Termination phase: Saturation 0.16/0.33 0.16/0.33 % (11963)Memory used [KB]: 5500 0.16/0.33 % (11963)Time elapsed: 0.003 s 0.16/0.33 % (11963)Instructions burned: 2 (million) 0.16/0.33 % (11963)------------------------------ 0.16/0.33 % (11963)------------------------------ 0.16/0.33 % (11962)Instruction limit reached! 0.16/0.33 % (11962)------------------------------ 0.16/0.33 % (11962)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200) 0.16/0.33 % (11961)Refutation not found, incomplete strategy 0.16/0.33 % (11961)------------------------------ 0.16/0.33 % (11961)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200) 0.16/0.33 % (11962)Termination reason: Unknown 0.16/0.33 % (11961)Termination reason: Refutation not found, incomplete strategy 0.16/0.33 0.16/0.33 0.16/0.33 % (11962)Termination phase: Saturation 0.16/0.33 0.16/0.33 % (11961)Memory used [KB]: 5500 0.16/0.33 % (11962)Memory used [KB]: 5500 0.16/0.33 % (11961)Time elapsed: 0.004 s 0.16/0.33 % (11962)Time elapsed: 0.004 s 0.16/0.33 % (11961)Instructions burned: 1 (million) 0.16/0.33 % (11962)Instructions burned: 3 (million) 0.16/0.33 % (11961)------------------------------ 0.16/0.33 % (11961)------------------------------ 0.16/0.33 % (11962)------------------------------ 0.16/0.33 % (11962)------------------------------ 0.16/0.34 % (11964)Refutation not found, incomplete strategy 0.16/0.34 % (11964)------------------------------ 0.16/0.34 % (11964)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200) 0.16/0.34 % (11964)Termination reason: Refutation not found, incomplete strategy 0.16/0.34 0.16/0.34 0.16/0.34 % (11964)Memory used [KB]: 5500 0.16/0.34 % (11964)Time elapsed: 0.005 s 0.16/0.34 % (11964)Instructions burned: 3 (million) 0.16/0.34 % (11964)------------------------------ 0.16/0.34 % (11964)------------------------------ 0.16/0.34 % (11960)Instruction limit reached! 0.16/0.34 % (11960)------------------------------ 0.16/0.34 % (11960)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200) 0.16/0.34 % (11960)Termination reason: Unknown 0.16/0.34 % (11960)Termination phase: Saturation 0.16/0.34 0.16/0.34 % (11960)Memory used [KB]: 5500 0.16/0.34 % (11960)Time elapsed: 0.005 s 0.16/0.34 % (11960)Instructions burned: 4 (million) 0.16/0.34 % (11960)------------------------------ 0.16/0.34 % (11960)------------------------------ 0.16/0.34 % (11959)First to succeed. 0.16/0.34 % (11965)Also succeeded, but the first one will report. 0.16/0.34 % (11959)Refutation found. Thanks to Tanya! 0.16/0.34 % SZS status Theorem for E---3.1_11852 0.16/0.34 % SZS output start Proof for E---3.1_11852 0.16/0.34 thf(func_def_0, type, cN: $i > $i). 0.16/0.34 thf(func_def_1, type, cM: $i > $i). 0.16/0.34 thf(func_def_5, type, sK0: ($i > $i) > $o). 0.16/0.34 thf(func_def_8, type, ph2: !>[X0: $tType]:(X0)). 0.16/0.34 thf(f92,plain,( 0.16/0.34 $false), 0.16/0.34 inference(avatar_sat_refutation,[],[f24,f33,f39,f73,f91])). 0.16/0.34 thf(f91,plain,( 0.16/0.34 spl1_3 | ~spl1_4), 0.16/0.34 inference(avatar_contradiction_clause,[],[f90])). 0.16/0.34 thf(f90,plain,( 0.16/0.34 $false | (spl1_3 | ~spl1_4)), 0.16/0.34 inference(subsumption_resolution,[],[f89,f48])). 0.16/0.34 thf(f48,plain,( 0.16/0.34 ( ! [X0 : $i] : (((cN @ X0) = (cM @ X0))) )), 0.16/0.34 inference(leibniz_equality_elimination,[],[f14])). 0.16/0.34 thf(f14,plain,( 0.16/0.34 ( ! [X0 : $i > $o,X1 : $i] : (($true = (X0 @ (cN @ X1))) | ((X0 @ (cM @ X1)) = $false)) )), 0.16/0.34 inference(binary_proxy_clausification,[],[f11])). 0.16/0.34 thf(f11,plain,( 0.16/0.34 ( ! [X0 : $i > $o,X1 : $i] : (((X0 @ (cN @ X1)) = (X0 @ (cM @ X1)))) )), 0.16/0.34 inference(cnf_transformation,[],[f9])). 0.16/0.34 thf(f9,plain,( 0.16/0.34 ! [X0 : $i > $o,X1] : ((X0 @ (cN @ X1)) = (X0 @ (cM @ X1))) & ((sK0 @ cM) != (sK0 @ cN))), 0.16/0.34 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8])). 0.16/0.34 thf(f8,plain,( 0.16/0.34 ? [X2 : ($i > $i) > $o] : ((X2 @ cM) != (X2 @ cN)) => ((sK0 @ cM) != (sK0 @ cN))), 0.16/0.34 introduced(choice_axiom,[])). 0.16/0.34 thf(f7,plain,( 0.16/0.34 ! [X0 : $i > $o,X1] : ((X0 @ (cN @ X1)) = (X0 @ (cM @ X1))) & ? [X2 : ($i > $i) > $o] : ((X2 @ cM) != (X2 @ cN))), 0.16/0.34 inference(rectify,[],[f6])). 0.16/0.34 thf(f6,plain,( 0.16/0.34 ! [X1 : $i > $o,X0] : ((X1 @ (cN @ X0)) = (X1 @ (cM @ X0))) & ? [X2 : ($i > $i) > $o] : ((X2 @ cM) != (X2 @ cN))), 0.16/0.34 inference(ennf_transformation,[],[f5])). 0.16/0.34 thf(f5,plain,( 0.16/0.34 ~(! [X1 : $i > $o,X0] : ((X1 @ (cN @ X0)) = (X1 @ (cM @ X0))) => ! [X2 : ($i > $i) > $o] : ((X2 @ cM) = (X2 @ cN)))), 0.16/0.34 inference(fool_elimination,[],[f4])). 0.16/0.34 thf(f4,plain,( 0.16/0.34 ~(! [X0,X1 : $i > $o] : ((X1 @ (cM @ X0)) <=> (X1 @ (cN @ X0))) => ! [X2 : ($i > $i) > $o] : ((X2 @ cN) <=> (X2 @ cM)))), 0.16/0.34 inference(rectify,[],[f2])). 0.16/0.34 thf(f2,negated_conjecture,( 0.16/0.34 ~(! [X1,X2 : $i > $o] : ((X2 @ (cM @ X1)) <=> (X2 @ (cN @ X1))) => ! [X0 : ($i > $i) > $o] : ((X0 @ cN) <=> (X0 @ cM)))), 0.16/0.34 inference(negated_conjecture,[],[f1])). 0.16/0.34 thf(f1,conjecture,( 0.16/0.34 ! [X1,X2 : $i > $o] : ((X2 @ (cM @ X1)) <=> (X2 @ (cN @ X1))) => ! [X0 : ($i > $i) > $o] : ((X0 @ cN) <=> (X0 @ cM))), 0.16/0.34 file('/export/starexec/sandbox/tmp/tmp.b7MyrQN9f1/E---3.1_11852.p',cEXT_A_LEIB2)). 0.16/0.34 thf(f89,plain,( 0.16/0.34 ((cM @ sK4) != (cN @ sK4)) | (spl1_3 | ~spl1_4)), 0.16/0.34 inference(negative_extensionality,[],[f88])). 0.16/0.34 thf(f88,plain,( 0.16/0.34 (cN != cM) | (spl1_3 | ~spl1_4)), 0.16/0.34 inference(trivial_inequality_removal,[],[f79])). 0.16/0.34 thf(f79,plain,( 0.16/0.34 (cN != cM) | ($false != $false) | (spl1_3 | ~spl1_4)), 0.16/0.34 inference(constrained_superposition,[],[f27,f32])). 0.16/0.34 thf(f32,plain,( 0.16/0.34 ((sK0 @ cM) = $false) | ~spl1_4), 0.16/0.34 inference(avatar_component_clause,[],[f30])). 0.16/0.34 thf(f30,plain,( 0.16/0.34 spl1_4 <=> ((sK0 @ cM) = $false)), 0.16/0.34 introduced(avatar_definition,[new_symbols(naming,[spl1_4])])). 0.16/0.34 thf(f27,plain,( 0.16/0.34 ($false != (sK0 @ cN)) | spl1_3), 0.16/0.34 inference(avatar_component_clause,[],[f26])). 0.16/0.34 thf(f26,plain,( 0.16/0.34 spl1_3 <=> ($false = (sK0 @ cN))), 0.16/0.34 introduced(avatar_definition,[new_symbols(naming,[spl1_3])])). 0.16/0.34 thf(f73,plain,( 0.16/0.34 ~spl1_1 | ~spl1_3), 0.16/0.34 inference(avatar_contradiction_clause,[],[f72])). 0.16/0.34 thf(f72,plain,( 0.16/0.34 $false | (~spl1_1 | ~spl1_3)), 0.16/0.34 inference(trivial_inequality_removal,[],[f71])). 0.16/0.34 thf(f71,plain,( 0.16/0.34 ((cN @ sK3) != (cN @ sK3)) | (~spl1_1 | ~spl1_3)), 0.16/0.34 inference(superposition,[],[f44,f48])). 0.16/0.34 thf(f44,plain,( 0.16/0.34 ((cM @ sK3) != (cN @ sK3)) | (~spl1_1 | ~spl1_3)), 0.16/0.34 inference(negative_extensionality,[],[f43])). 0.16/0.34 thf(f43,plain,( 0.16/0.34 (cN != cM) | (~spl1_1 | ~spl1_3)), 0.16/0.34 inference(trivial_inequality_removal,[],[f41])). 0.16/0.34 thf(f41,plain,( 0.16/0.34 ($true = $false) | (cN != cM) | (~spl1_1 | ~spl1_3)), 0.16/0.34 inference(constrained_superposition,[],[f28,f19])). 0.16/0.34 thf(f19,plain,( 0.16/0.34 ((sK0 @ cM) = $true) | ~spl1_1), 0.16/0.34 inference(avatar_component_clause,[],[f17])). 0.16/0.34 thf(f17,plain,( 0.16/0.34 spl1_1 <=> ((sK0 @ cM) = $true)), 0.16/0.34 introduced(avatar_definition,[new_symbols(naming,[spl1_1])])). 0.16/0.34 thf(f28,plain,( 0.16/0.34 ($false = (sK0 @ cN)) | ~spl1_3), 0.16/0.34 inference(avatar_component_clause,[],[f26])). 0.16/0.34 thf(f39,plain,( 0.16/0.34 ~spl1_2 | ~spl1_3), 0.16/0.34 inference(avatar_contradiction_clause,[],[f38])). 0.16/0.34 thf(f38,plain,( 0.16/0.34 $false | (~spl1_2 | ~spl1_3)), 0.16/0.34 inference(trivial_inequality_removal,[],[f35])). 0.16/0.34 thf(f35,plain,( 0.16/0.34 ($true = $false) | (~spl1_2 | ~spl1_3)), 0.16/0.34 inference(superposition,[],[f23,f28])). 0.16/0.34 thf(f23,plain,( 0.16/0.34 ($true = (sK0 @ cN)) | ~spl1_2), 0.16/0.34 inference(avatar_component_clause,[],[f21])). 0.16/0.34 thf(f21,plain,( 0.16/0.34 spl1_2 <=> ($true = (sK0 @ cN))), 0.16/0.34 introduced(avatar_definition,[new_symbols(naming,[spl1_2])])). 0.16/0.34 thf(f33,plain,( 0.16/0.34 spl1_3 | spl1_4), 0.16/0.34 inference(avatar_split_clause,[],[f13,f30,f26])). 0.16/0.34 thf(f13,plain,( 0.16/0.34 ($false = (sK0 @ cN)) | ((sK0 @ cM) = $false)), 0.16/0.34 inference(binary_proxy_clausification,[],[f10])). 0.16/0.34 thf(f10,plain,( 0.16/0.34 ((sK0 @ cM) != (sK0 @ cN))), 0.16/0.34 inference(cnf_transformation,[],[f9])). 0.16/0.34 thf(f24,plain,( 0.16/0.34 spl1_1 | spl1_2), 0.16/0.34 inference(avatar_split_clause,[],[f12,f21,f17])). 0.16/0.34 thf(f12,plain,( 0.16/0.34 ($true = (sK0 @ cN)) | ((sK0 @ cM) = $true)), 0.16/0.34 inference(binary_proxy_clausification,[],[f10])). 0.16/0.34 % SZS output end Proof for E---3.1_11852 0.16/0.34 % (11959)------------------------------ 0.16/0.34 % (11959)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200) 0.16/0.34 % (11959)Termination reason: Refutation 0.16/0.34 0.16/0.34 % (11959)Memory used [KB]: 5500 0.16/0.34 % (11959)Time elapsed: 0.006 s 0.16/0.34 % (11959)Instructions burned: 4 (million) 0.16/0.34 % (11959)------------------------------ 0.16/0.34 % (11959)------------------------------ 0.16/0.34 % (11958)Success in time 0.018 s 0.16/0.34 EOF